Intersection Logic in sequent calculus style
نویسندگان
چکیده
منابع مشابه
Intersection Logic in sequent calculus style
The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus. But its relation with the logic is not standard. Between all the logics that have been proposed as its foundation, we consider ISL, which gives a logical interpretation of the intersecti...
متن کاملSuppes-style sequent calculus for probability logic
Deduction relation naturally connecting a set Γ of hypotheses with a conclusion A, usually denoted by Γ ` A, presents a basic notion of traditional logic. The framework of approximative and vague reasoning needs a new concept of such a connection enabling to express that ’A follows from Γ with probability p’. In this paper, following the Gentzen’s approach to the formalization of the deduction ...
متن کاملSequent Calculus for Intuitionistic Logic
We present a system of sequent calculus for intuitionistic propositional logic. In later chapters we obtain stronger systems by adding rules to this basic system, and we therefore go through its proof-theoretical properties in detail, in particular the admissibility of structural rules and the basic consequences of cut elimination. Many of these properties can then be verified in a routine fash...
متن کاملA Sequent Calculus for Intuitionistic Default Logic
Current research on non-monotonic reasoning shows growing interest on implementation details, so the need for concrete calculi formalizing non-monotonic logics is clearly recognized. On the other hand, there is also an increased number of works combining intuitionistic logic with various kinds of non-monotonic formalisms. As a case in point, intuitionistic versions of both default and autoepist...
متن کاملA Sequent Calculus for Dynamic Topological Logic
We introduce a sequent calculus for the temporal-over-topological fragment DTL ◦∗/2 0 of dynamic topological logic DTL, prove soundness semantically, and prove completeness syntactically using the axiomatization of DTL ◦∗/2 0 given in [3]. A cut-free sequent calculus for DTL ◦∗/2 0 is obtained as the union of the propositional fragment of Gentzen’s classical sequent calculus, two 2 structural r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.45.2